A Trade - off for Worst - Case Efficientdictionariesrasmus
نویسنده
چکیده
منابع مشابه
A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملTransformation of Sporadic Tasks for Off-line Scheduling with Utilization and Response Time Trade-offs
Many safety critical real-time systems follow the time triggered approach using off-line scheduling methods for reasons of determinism, simple fault tolerance, certifiability, etc. By their very nature, offline schedules cannot handle activities which are not known completely at design time. While some methods have been presented to integrate event-triggered activities at runtime, these require...
متن کاملAN EXTENSION TO STOCHASTIC TIME-COST TRADE-OFF PROBLEM OPTIMIZATION WITH DISCOUNTED CASH FLOW
In this paper, an efficient multi-objective model is proposed to solve time-cost trade off problem considering cash flows. The proposed multi-objective meta-heuristic is based on Ant colony optimization and is called Non Dominated Archiving Ant Colony Optimization (NAACO). The significant feature of this work is consideration of uncertainties in time, cost and more importantly interest rate. A ...
متن کاملTrading off Worst and Expected Cost in Decision Tree Problems and a Value Dependent Model
We study the problem of evaluating a discrete function by adaptively querying the values of its variables until the values read uniquely determine the value of the function. Reading the value of a variable is done at the expense of some cost, and the goal is to design a strategy (decision tree) for evaluating the function incurring as little cost as possible in the worst case or in expectation ...
متن کاملOptimal Randomized Comparison Based Algorithms for Collision
We consider the well known problem of finding two identical elements, called a collision, in a list of n numbers. Here, the (very fast) comparison based algorithms are randomized and will only report existing collisions, and do this with (small) probability p, the success probability. We find a trade-off between p and the running time t, and show that this trade-off is optimal up to a constant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007